Emergent Computation for Semantic Interpretation by Rule-Based Equivalent Transformation
نویسندگان
چکیده
We propose a method for emerging eecient processing for semantic interpretation. In this method, creation of many individual algorithms written to handle various situations is avoided, and the basic knowledge in an object domain and the situation in which a sentence was uttered as well as the given sentence are described as a declarative program. Semantic interpretation is then performed by equivalent transformation using correct rules. With this method, eecient processing matched to changing conditions emerges naturally in the computation process.
منابع مشابه
Subsumption for Semantic Query Optimization in OODB
The purpose of semantic query optimization is to use semantic knowledge (e.g. integrity constraints) for transforming a query into an equivalent one that may be answered more eeciently than the original version. This paper proposes a general method for semantic query optimization in the framework of OODBs (Object Oriented Database Systems). The method is applicable to the class of conjunctive q...
متن کاملComponentwise Program Construction: The Equivalent Transformation Computation Model versus the Logic Programming Model
In the equivalent transformation (ET) computation model, a program is a set of procedural rewriting rules for answer-preserving transformation of problems with respect to given background knowledge. In this paper, we discuss an approach to program construction by creating and accumulating individually correct and efficient program components one by one, referred to as componentwise program cons...
متن کاملMetaphor , Relevance and the ‘ Emergent Property ’
The interpretation of metaphorical utterances often results in the attribution of emergent properties, which are neither standardly associated with the individual constituents in isolation nor derivable by standard rules of semantic composition. An adequate pragmatic account of metaphor interpretation must explain how these properties are derived. Using the framework of relevance theory, we pro...
متن کاملModeling Answer Constraints in Constraint Logic Programs
The constraint logic programming paradigm CLP(X) (CLP for short) has been proposed by Jaaar and Lassez in order to integrate a generic computational mechanism based on constraints with the logic programming framework. This paradigm retains the semantic properties of logic languages, namely the existence of equivalent operational, model theo-retic and xpoint semantics. Moreover, since computatio...
متن کاملThe Squeeze Method: A Method for Program Construction in the Equivalent Transformation Computation Model
In the equivalent transformation (ET) computation model, a specification provides background knowledge in a problem domain, a program is a set of prioritized rewriting rules, and computation consists in successive reduction of problems by rule application. As long as meaning-preserving rewriting rules, called ET rules, with respect to given background knowledge are used, correct computation res...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001